Actively Monitoring Peers in KAD

نویسندگان

  • Moritz Steiner
  • Ernst W. Biersack
  • Taoufik En-Najjary
چکیده

In recent years, a large number of DHTs have been proposed. However, very few of them have been deployed in real-life large scale systems. An exception is KAD, a DHT based on Kademlia that is part of the widely used eMule peer-to-peer system, which has more than 1.5 million simultaneous users. We have developed a very fast crawler and explored KAD for more than a month by crawling part of the KAD ID space, which takes only a few seconds. We find that there are two classes of peers, long-lived peers that participate in KAD for weeks and short-lived peers that remain in KAD no more than few days before they permanently leave. Most of the peers that join KAD for the first time are short-lived peers. Since inter-session times can be as large as one week, one needs to crawl KAD for more than a week to be able to identify and characterize short-lived peers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-scale monitoring of DHT traffic

Studying deployed Distributed Hash Tables (DHTs) entails monitoring DHT traffic. Commonly, DHT traffic is measured by instrumenting ordinary peers to passively record traffic. In this approach, using a small number of peers leads to a limited (and potentially biased) view of traffic. Alternatively, inserting a large number of peers may disrupt the natural traffic patterns of the DHT and lead to...

متن کامل

Load Reduction in the KAD Peer-to-Peer System

Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHTs have been implemented in real systems and deployed on a large scale. One exception is kad, a DHT based on Kademlia, which is part of eDonkey, a peer-topeer file sharing system with several million simultaneous users. In thi...

متن کامل

Detection and mitigation of localized attacks in a widely deployed P2P network

Several large scale P2P networks operating on the Internet are based on a Distributed Hash Table. These networks offer valuable services, but they all suffer from a critical issue allowing malicious nodes to be inserted in specific places on the DHT for undesirable purposes (monitoring, distributed denial of service, pollution, etc.). While several attacks and attack scenarios have been documen...

متن کامل

Digging Into KAD Users’ Shared Folders

Characterizing peer-to-peer overlays is crucial for understanding their impact on service provider networks and assessing their performance. Most popular file exchange applications use distributed hash tables (DHTs) as a framework for managing information. Their fully decentralized nature makes monitoring and users tracking challenging. In this work, we analyze KAD, a widely deployed DHT system...

متن کامل

eDonkey & eMule's Kad: Measurements & Attacks

This article reports on the results of our measurement study of the Kad network. Although several fully decentralized peer-to-peer systems have been proposed in the literature, most existing systems still employ a centralized architecture. The Kad network is a notable exception. Since the demise of the Overnet network, the Kad network has become the most popular peer-topeer system based on a di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007